Light-weight key distribution scheme in wireless network

ABSTRACT

This scheme proposes a method for reducing the number of security keys allocated to each node of a wireless network, and number of security keys required by the wireless network. N nodes are grouped into a first and a second groups, each group comprising N/2 nodes without nodes being shared. The first group is grouped such that at least two nodes are included and at least one node is different, and first security keys are allocated to the first group nodes without any security keys being shared among the groups. (N/2) groups are grouped to include a security key arrangement of (B/2) number of security keys of B number of second security keys, and the second security keys of each group are allocated to each node of the first group. Here, the security key arrangement of each group differs from that of the others.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of Russian Patent Application No.2004103558 filed Feb. 9, 2004, in the Russian Patent Office, the disclosure of which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a distribution of security keys among nodes of a wireless network. More particularly, the present invention proposes a scheme aiming to reduce a number of security keys for storages in each node.

2. Description of the Related Art

Nodes of a wireless network set security keys to protect data from a third party with malice during transmission and reception. In other words, each node encrypts data using set security keys and transmits encrypted data, and therefore, data can be transmitted and received safely from the harm of the malicious party.

Currently available schemes for the nodes of a wireless network, or more particularly, of an ad-hoc network, to set security keys will be briefly described below.

First, each node can set security key using a channel other than a channel for data transmission. In other words, the nodes may set security keys using infrared rays or using lines. In these cases, the nodes are located at a short transmission distance and therefore, intrusion of unwanted third party can be generally avoided. However, such a short transmission distance also works as a disadvantageous because the coverage of nodes setting security keys is limited only within a short distance.

The nodes may set security keys by a direct contact, or using human body as a channel. In other words, tie nodes may set security keys using an electric current flowing in a human body contacting therewith. This scheme, however, provides a restriction that a separate channel needs be used in addition to channels for communication among the nodes.

Secondly, a sending node and a receiving node may transmit and receive data using a public key. However, this requires a large amount of computations for data encryption or decryption.

Meanwhile, RSA is an encryption code which has been developed by Ron Rivest, Adi Shamir and Leonard Adleman. The RSA mainly utilizes the tact that the resolution of large integers into factors is difficult and is currently popular. However, the elliptical curve cryptography and resolution into factors with 514-bits have recently attacked the RSA, and therefore, larger modulus ‘n’ was used to construct safer RSA cryptography system. Accordingly, 1024-bit security keys are currently used.

FIG. 1 illustrates nodes constructing a wireless network. According to FIG. 1, a wireless network includes a first node 101 to fourth node 104.

A method of the nodes of a conventional wireless network for setting security keys will now he described below.

First, all the nodes of a wireless network can allocate identical security keys. Accordingly, the first to fourth nodes 101˜104 are allocated with the same security key. That is, when the first node 101 has data to transmit to the second to fourth nodes 102˜104, the first node 101 encrypts data using one security key and transmits the encrypted data. By doing so, the number of security keys to be stored in each node can be minimized. In other words, one security key is stored in each of the nodes even when the number of nodes increases in a wireless network. Accordingly, the wireless network also requires one security key.

However, sharing a single security key among the first to fourth nodes 101˜104 is accompanied with a security risk because the security key of all nodes is exposed when even one node exposes the security key thereof. Accordingly, a solution to this problem is demanded.

Secondly, nodes of a wireless network can be allocated with different security keys, which is illustrated in FIG. 2.

A wireless network allocates first to sixth security keys stored therein to the respective nodes. Namely, the first node 101 is allocated with the first to third security keys, and the second node 102 is allocated with the first, fourth and fifth security keys. The third node 103 is allocated with the second, fourth and sixth security keys, and the fourth node 104 is allocated with the third, fifth and sixth security keys.

The first node 101 uses the first security key to transmit data to the second node 102, uses the second security key to transmit data to the third node 103, and uses the third security key to transmit data to the fourth node 104. The second node 102 uses the first security key to transmit data to the first node 101, uses the fourth security key to transmit data to the third node 103, and uses the fifth security key to transmit data to the fourth node 104. The third node 103 uses the second security key to transmit data to the first node, uses the fourth security key to transmit data to the third node 103 and uses the sixth security key to transmit data to the fourth node 104. The fourth node 04 uses the third security key to transmit data to the first node 101, uses the fifth security key to transmit the data to the second node 102, and uses the sixth security key to transmit data to the third node 103.

By allocating a pair of nodes with their own security keys, all the other security keys can remain hidden even when a certain security key is exposed. However, as the number of nodes increases in a wireless network, the number of security keys to be stored in the nodes also increases, and therefore, the number of security keys required by the wireless network also increases. The following equation 1 shows the number of security keys required to be stored in each node when the number of nodes is ‘N’. Number of security keys required to be stored in each node−N−1   [Equation 1]

The following equation 2 shows the number of security keys required by a wireless network when the number of nodes of the wireless network is ‘N’. Number of security keys required in wireless network=(N−1)+(N−2)+ . . . +1   [Equation 1]

As inferred from the equation 1, the security keys required to be stored in each node increases when the number of nodes of a wireless network increases. And as inferred from the equation 2, the number of security keys required in a wireless network increases by geometric progression when the number of nodes of a wireless network increase. Accordingly, a method is required to reduce number of required security keys when the number of wireless network nodes increases.

SUMMARY OF THE INVENTION

In order to solve the problems of conventional technologies, it is an object of the present invention to provide a method to reduce number of required security keys when the number of nodes increase in a wireless network.

It is another object of the present invention to provide a method to reduce number of security keys for allocation to each node when the number of nodes of a wireless network increases.

Accordingly, in order to achieve the above-mentioned objects and/or other features of the present invention, a method for allocating a security key to each node of a communication system having N nodes, includes: grouping N nodes into a first and a second groups, each group comprising N/2 nodes without nodes being shared; grouping the first group such that at least two nodes arc included and at least one node is different, and allocating first security keys to the first group nodes without security keys being shared among the groups; and grouping (N/2) groups, each of which including a security key arrangement of (B/2) number of security keys of B number of second security keys, with the security key arrangement of each group differing from that of the others, and allocating the second security keys of each group to each node of the first group.

BRIEF DESCRIPTION OF THE DRAWINGS

The above aspects and features of the present invention will be more apparent by describing certain embodiments of the present invention with reference to the accompanying drawings in which:

FIG. 1 is a view illustrating nodes of a conventional wireless network;

FIG. 2 is a view illustrating an exemplary embodiment in which security keys are allocated to each node of a wireless network having four nodes; and

FIG. 3 is a view illustrating an exemplary embodiment in which security keys are allocated to each node of a wireless network having eight nodes.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Certain embodiments of the present invention will be described in greater detail with reference to the accompanying drawings.

In the following description, same drawing reference numerals are used for the same elements even in different drawings. The matters defined in the description such as a detailed construction and elements are nothing but the ones provided to assist in a comprehensive understanding of the invention. Thus, it is apparent that the present invention can be carried out without those defined matters. Also, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail.

The present invention aims to propose to use a half-weight column to generate a security key. The half-weight column refers to a column in which elements ‘0’ and elements ‘1’ are arranged in an identical number. The example below will help explain the present invent ion in more detail. The following mathematical formula 3 illustrates one example of half-weight column having six elements therein. $\begin{matrix} \begin{bmatrix} 0 \\ 0 \\ 1 \\ 1 \\ 0 \\ 1 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 3} \right\rbrack \end{matrix}$

The following mathematical formula 4 illustrates one example of half-weight column having eight elements therein. $\begin{matrix} \begin{bmatrix} 0 \\ 1 \\ 1 \\ 1 \\ 0 \\ 1 \\ 0 \\ 0 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 4} \right\rbrack \end{matrix}$

The following mathematical formula 5 illustrates one example of half-weight column having ten elements therein. $\begin{matrix} \begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \\ 1 \\ 1 \\ 1 \\ 1 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 5} \right\rbrack \end{matrix}$

As inferred from mathematical formulas 3 to 5, elements ‘0’ and elements ‘1’ are arranged in the column in an identical number. The following mathematical formula 6 illustrates one example of half-weight column having six elements therein. $\begin{matrix} \begin{bmatrix} 0 & 1 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 1 & 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 1 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 1 & 0 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 6} \right\rbrack \end{matrix}$

The following mathematical formula 7 illustrates one example of a matrix (hereinafter called a ‘half-weight matrix’) which has a part of the elements of the mathematical formula 6. $\begin{matrix} \begin{bmatrix} 1 & 1 & 1 & 1 \\ 0 & 1 & 1 & 1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 7} \right\rbrack \end{matrix}$

One will understand that the mathematical formula 7 represents a (4×6 ) half-weight matrix.

The followings mathematical formula 8 illustrates one example of a complementary matrix of the half-weight matrix of the mathematical formula 7. The complementary matrix contains element ‘0’ converted into element ‘1’, and elements ‘1’ converted into elements ‘0’. $\begin{matrix} \begin{bmatrix} 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 8} \right\rbrack \end{matrix}$

The original matrix is ‘B’, and the complementary matrix is ‘{overscore (B)}’.

The present invention proposes to generate security keys by using the following mathematical formula 9. $\begin{matrix} \begin{bmatrix} A & A \\ B & \overset{\_}{B} \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 9} \right\rbrack \end{matrix}$

‘A’ is a minimum matrix required to allocate security keys to a plurality of nodes. This will be explained in greater detail below with reference to an example.

It will be taken as an example that the security keys are allocated to six nodes. First, a method to allocate security keys to three nodes will be explained. The following mathematical formula 10 represents a method to allocate security keys to three nodes. $\begin{matrix} {A = \begin{bmatrix} 1 & 1 & 0 \\ 1 & 0 & 1 \\ 0 & 1 & 1 \end{bmatrix}} & \left\lbrack {{Mathematical}\quad{formula}\quad 10} \right\rbrack \end{matrix}$

In the matrix presented by the mathematical formula 10, element ‘1’ indicates that a corresponding security key is allocated, while element ‘0’ indicates no allocation of security key. In other words, element ‘1’ at the first row allocates the first security key, and element ‘1’ at the second row allocates the second security key. Element ‘1’ at the third row allocates the third security key. Additionally, the first column of the matrix represents security keys allocated to the first node, and the second column represents security keys allocated to the second node. The third column represents the security keys allocated to the first node. More specifically, the first node is allocated with the first and second security keys, and the second node is allocated with the first and third security keys. The third node is allocated with the second and the third security keys.

When a wireless network includes N nodes, the number of elements of the columns is (N-2). Namely, when there are six nodes in a wireless network, a half-weight matrix having 4 elements in its column, is obtained.

The following mathematical formula 11 represents a half-weight column which has four elements in a column. $\begin{matrix} \begin{bmatrix} 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 & 1 & 1 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 11} \right\rbrack \end{matrix}$

The following mathematical formula 12 represents (3×4) matrix using columns extracted from those of the mathematical formula 11. $\begin{matrix} \begin{bmatrix} 1 & 1 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 12} \right\rbrack \end{matrix}$

The following mathematical formula 13 represents a complementary matrix of that of the mathematical formula 12. $\begin{matrix} {\overset{\_}{B} = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{bmatrix}} & \left\lbrack {{Mathematical}\quad{formula}\quad 13} \right\rbrack \end{matrix}$

The following mathematical formula 14 represents security keys which are allocated to the six nodes by using the mathematical formula 9. $\begin{matrix} {\begin{bmatrix} A & A \\ B & \overset{\_}{B} \end{bmatrix} = \begin{bmatrix} 1 & 1 & 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 1 & 1 & 0 \end{bmatrix}} & \left\lbrack {{Mathematical}\quad{formula}\quad 14} \right\rbrack \end{matrix}$

The security keys being allocated to each node by using the mathematical formula 14 can be listed as the following table. TABLE 1 1^(st) node 2^(nd) node 3^(rd) node 4^(th) node 5^(th) node 6^(th) node 1^(st) security key 1 1 0 1 1 0 2^(nd) security key 1 0 1 1 0 1 3^(rd) security key 0 1 1 0 1 1 4^(th) security key 1 1 1 0 0 0 5^(th) security key 1 0 0 0 1 1 6^(th) security key 0 1 0 1 0 1 7^(th) security key 0 0 1 1 1 0

In the above table 1, element ‘1’ indicates that a corresponding security key is allocated, while element ‘0’ indicates no allocation of security key. When each node is allocated with security keys as in the table 1, a node pair intending to communicate uses an identical security key among the allocated keys for the communication.

More specifically, the first and second nodes intending to communicate with each other use the first and fourth security keys in communication. When the third and fourth nodes intend to communicate with each other, the nodes use the second and seventh security keys in communication. When the fifth and sixth nodes intend to communicate, the nodes use the third and fifth security keys in communication.

Accordingly, the number of security keys allocated to each node, and the number of security keys required by the wireless network, can be reduced as it can be inferred from the table 1. In other words, while a conventional six-node wireless network requires 15 security keys, and wireless network proposed by the present invention requires only 7 security keys. Additionally, while a conventional six-node wireless network requires 5 security keys for allocation to each node, the present invention proposes to allocate only 4 security keys to each node.

It will be taken as an example that the security keys are allocated to eight nodes. First, a method to allocate security keys to four nodes will be explained. FIG. 2 illustrates a method to allocate security keys to four nodes. Furthermore, as mentioned above, the mathematical formula 6 represents a half-weight column having six elements therein, and the mathematical formula 7 represents a half-weight column having a matrix which uses a part of columns extracted from those of the half-weight column of mathematical formula 6. The mathematical formula 8 represents a complementary weight of the mathematical formula 7.

The following mathematical formula 15 represents security keys being allocated to eight nodes by using the mathematical formula 9. $\begin{matrix} \begin{bmatrix} 1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 \\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 1 & 1 & 1 \\ 0 & 1 & 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 \end{bmatrix} & \left\lbrack {{Mathematical}\quad{formula}\quad 15} \right\rbrack \end{matrix}$

FIG. 3 shows the security keys being allocated to each node by using the mathematical formula 15.

Again, FIG. 3 shows that the number of security keys for allocation to each node, and the number of security keys required by a wireless network decrease. More specifically, while a conventional 8-node wireless network requires 28 security keys, the present invention requires only 12 security keys. Additionally, while a conventional 8-node wireless network requires 7 security keys for allocation to each node, the present invention requires only 6 security keys for allocation to each node.

As described above in a few exemplary embodiments of the present invention, when the security keys are allocated to each node according to the present invention, the number of security keys for allocation to each node and the number of security keys required by a wireless network can be reduced. Accordingly, each node can store respectively-allocated security keys with use of minimum memory.

The foregoing embodiments and advantages are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. Also, the description of the embodiments of the present invention is intended to be illustrative, and not to limit the scope of the claims, and many alternatives, modifications, and variations will be apparent to those skilled in the art. 

1. A method for allocating a security key to each node of a communication system having N nodes, comprising: grouping N nodes into a first and a second groups, each group comprising N/2 nodes without nodes being shared; grouping the first group such that at least two nodes are included and at least one node is different, and allocating first security keys to the first group nodes without security keys being shared among the groups; and grouping (N/2) groups, each of which including a security key arrangement of (B/2) number of security keys of B number of second security keys, with the security key arrangement of each group differing from that of the others, and allocating the second security keys of each group to each node of the first group.
 2. The method of claim 1, wherein the nodes include in the second group are allocated with first security keys in the same manner.
 3. The method of claim 2, wherein (K)th node of the second group is allocated with the second security keys which are not allocated to the (K)th node of the first group.
 4. The method of claim 1, wherein two nodes intending to communication data use commonly allocated security keys in the data communication.
 5. The method of claim 1, wherein the number of the first security keys is represented by, Number of first security keys={(N/2)−1}+{(N/2)−2}+ . . . +1
 6. The method of claim 5, wherein the number of the second security keys is represented by, Number of second security keys=N−2
 7. The method of claim 6, wherein each node of the wireless network is allocated with [{(N/2)−1 }+{(N/2)−2}+ . . . +1]/2 of first security keys, and (N−2)/2 of second security keys. 